Full Abstraction for Series-Parallel Pomsets
نویسنده
چکیده
In this paper, we provide a behavioural characterization of the class of finite, seriesparallel pomsets by showing that this simple model based on partial orders is fullyabstract with respect to the behavioural equivalence obtained by applying Abramsky's testing scenario for bisimulation equivalence, [Ab87], in all refinement contexts, [AH89]. This casts the observability of series-parallel pornsets in a purely interleaving framework. Moreover, we prove that the order structure of a series-parallel pomset is completely revealed by its set of ST-traces, [GIg0], and provide a complete axiomatization of STtrace equivalence over the class of series-parallel pomsets.
منابع مشابه
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
We provide a denotational trace semantics for processes with synchronous communication and a form of weakly fair parallelism. The semantics is fully abstract: processes have the same trace sets if and only if their communication behaviors are identical in all contexts. The model can easily be adapted for asynchronously communicating processes, or for shared-memory parallel programs. We also pro...
متن کاملInfinite Series-Parallel Posets: Logic and Languages
We show that a set of uniformly width-bounded infinite seriesparallel pomsets is ω-series-rational iff it is axiomatizable in monadic second order logic iff it is ω-recognizable. This extends recent work by Lodaya and Weil on sets of finite series-parallel pomsets in two aspects: It relates their notion of series-rationality to logical concepts, and it generalizes the equivalence of recognizabi...
متن کاملRegular Sets of Pomsets with Autoconcurrency
Partially ordered multisets (or pomsets) constitute one of the most basic models of concurrency. We introduce and compare several notions of regularity for pomset languages by means of contexts and residues of different kinds. We establish some interesting closure properties that allow us to relate this approach to SP-recognizability in the particular case of series-parallel pomsets. Finally we...
متن کاملRecognizability of Pomset Languages with Event Reenement
In the present paper, we contribute to the theory of recognizable pom-set (or partial word) languages from an algebraic point of view. By substitutions in pomsets labelled with variables and pomset contexts, we deene the syntactic equivalence of a pomset language, and use nite index ones to deene recognizable languages. We show that the induced recognizable pomset languages have extended closur...
متن کاملAsynchronous Cellular Automata and Logic for Pomsets without Auto-concurrency
This paper extends to pomsets without auto-concurrency the fundamental notion of asynchronous cellular automata (ACA) which was originally introduced for traces by Zielonka. We generalize to pomsets the notion of asynchronous mapping introduced by Zielonka and we show how to construct a deterministic ACA from an asynchronous mapping. Our main result generalizes Buchi's theorem for nite words t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991